Closures in Binary Partial Algebras
نویسنده
چکیده
Two procedures for computing closures in binary partial algebras (BPA) are introduced: a Fibonacci-style procedure for closures in associative BPAs, and a multistage procedure for closures in associative, commutative and idempotent BPAs. Ramifications in areas such as resolution theorem proving, graph-theoretic algorithms, formal languages and formal concept analysis are discussed. In particular, the multistage procedure, when applied to formal concept analysis, results in a new algorithm outperforming leading algorithms for computing concept sets.
منابع مشابه
EF+EX Forest Algebras
We examine languages of unranked forests definable using the temporal operators EF and EX. We characterize the languages definable in this logic, and various fragments thereof, using the syntactic forest algebras introduced by Bojanczyk and Walukiewicz. Our algebraic characterizations yield efficient algorithms for deciding when a given language of forests is definable in this logic. The proofs...
متن کاملDisjoint-union partial algebras
Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are defined. We provide a recursive first-order axiomatisation of the class of partial algebras isomorphic to a disjointunion partial algebra of sets but prove that ...
متن کاملCartesian Closedness in Cat - Egories of Partial
Keywords: Exponential subcategory of a category, cartesian closed category, initially structured category, category of partial algebras of the same type, partial algebra fulllling the interchange law, diagonal partial algebra. Abstract: We study categories of partial algebras of the same type. In these categories we deene a binary operation of exponentiation for objects and investigate its beha...
متن کاملNormal and inhomogeneous moment closures for stochastic process algebras
This paper discusses the application of moment closures to continuous Markov chains derived from process algebras such as GPEPA and MASSPA. Two related approaches are being investigated. Firstly we re-formulate normal moment closure in a process algebra framework using Isserlis’ theorem. Secondly we apply a mixture of this normal closure and less precise moment closures for the purpose of reduc...
متن کاملSimilarity DH-Algebras
In cite{GL}, B. Gerla and I. Leuc{s}tean introduced the notion of similarity on MV-algebra. A similarity MV-algebra is an MV-algebra endowed with a binary operation $S$ that verifies certain additional properties. Also, Chirtec{s} in cite{C}, study the notion of similarity on L ukasiewicz-Moisil algebras. In particular, strong similarity L ukasiewicz-Moisil algebras were defined. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 257 شماره
صفحات -
تاریخ انتشار 2009